Genetic Algorithms for Uncertain Environments
نویسندگان
چکیده
منابع مشابه
Genetic Algorithms for Changing Environments
Genetic algorithms perform an adaptive search by maintaining a population of candidate solutions that are allocated dynamically to promising regions of the search space. The distributed nature of the genetic search provides a natural source of power for searching in changing environments. As long as sufficient diversity remains in the population the genetic algorithm can respond to a changing r...
متن کاملGenetic Algorithm in Uncertain Environments for Solving Stochastic Programming Problem
Many real problems with uncertainties may often be formulated as Stochastic Programming Problem. In this study, Genetic Algorithm (GA) which has been recently used for solving mathematical programming problem is expanded for use in uncertain environments. The modified GA is referred as GA in uncertain environments (GAUCE). In the method, the objective function and/or the constraint are fluctuat...
متن کاملGenetic Algorithms in Noisy Environments
Genetic Algorithms (GA) have been widely used in the areas of searching, function optimization, and machine learning. In many of these applications, the effect of noise is a critical factor in the performance of the genetic algorithms. While it hals been shown in previous siiudies that genetic algorithms are still able to perform effective121 in the presence of noise, tlhe problem of locating t...
متن کاملEvolutionary Multi-objective Optimization in Uncertain Environments - Issues and Algorithms
Now welcome, the most inspiring book today from a very professional writer in the world, evolutionary multi objective optimization in uncertain environments issues and algorithms studies in computational intelligence. This is the book that many people in the world waiting for to publish. After the announced of this book, the book lovers are really curious to see how this book is actually. Are y...
متن کاملGenetic Algorithms in Time-Dependent Environments
The influence of time-dependent fitnesses on the infinite population dynamics of simple genetic algorithms (without crossover) is analyzed. Based on general arguments, a schematic phase diagram is constructed that allows one to characterize the asymptotic states in dependence on the mutation rate and the time scale of changes. Furthermore, the notion of regular changes is raised for which the p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEJ Transactions on Electronics, Information and Systems
سال: 2001
ISSN: 0385-4221,1348-8155
DOI: 10.1541/ieejeiss1987.121.6_982